Approximation of Markov decision processes with general state space
نویسندگان
چکیده
منابع مشابه
The Policy Iteration Algorithm for Average Reward Markov Decision Processes with General State Space
The average cost optimal control problem is addressed for Markov decision processes with unbounded cost. It is found that the policy iteration algorithm generates a sequence of policies which are c-regular (a strong stability condition), where c is the cost function under consideration. This result only requires the existence of an initial c-regular policy and an irreducibility condition on the...
متن کاملMarkov Decision Processes with General Discount Functions
In Markov Decision Processes, the discount function determines how much the reward for each point in time adds to the value of the process, and thus deeply a ects the optimal policy. Two cases of discount functions are well known and analyzed. The rst is no discounting at all, which correspond to the totaland average-reward criteria. The second case is a constant discount rate, which leads to a...
متن کاملApproximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey
This article provides a survey of approximation metrics for stochastic processes. We deal with Markovian processes in discrete time evolving on general state spaces, namely on domains with infinite cardinality and endowed with proper measurability and metric structures. The focus of this work is to discuss approximation metrics between two such processes, based on the notion of probabilistic bi...
متن کاملState-space Dimensionality Reduction in Markov Decision Processes
Learning of autonomous agents during their interaction with the environment is one of the frequent tasks in machine learning. However, the efficiency of the learning process drops dramatically with the complexity of the problem domain. In this paper, we present a survey of existing methods for reduction of the dimensionality. These methods can help find efficient solutions to the reinforcement ...
متن کاملExtreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
We study infinite-horizon nonstationary Markov decision processes with discounted cost criterion, finite state space, and side constraints. This problem can equivalently be formulated as a countably infinite linear program (CILP), a linear program with countably infinite number of variables and constraints. We provide a complete algebraic characterization of extreme points of the CILP formulati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2012
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2011.11.015